Logarithmic sequences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logarithmic behavior of some combinatorial sequences

Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic behavior of some combinatorially relevant sequences, such as Motzkin and Schröder numbers, sequences of values of some classic orthogonal polynomials, and ma...

متن کامل

Logarithmic density in morphic sequences par

We study the logarithmic frequency of letters and words in morphic sequences and show that this frequency must always exist, answering a question of Allouche and Shallit.

متن کامل

Logarithmic bounds on the posterior divergence time of two sequences

When two initially identical binary sequences undergo independent site mutations at a constant rate, the proportion of site differences is often used to estimate the total time T that separates the two sequences. In this short note we study the posterior distribution of T when the prior distribution on T is exponential. We show that posterior estimates of T (for any data) cannot grow faster tha...

متن کامل

Logarithmic density and logarithmic statistical convergence

In this paper we use the idea of logarithmic density to define the concept of logarithmic statistical convergence. We find the relations of logarithmic statistical convergence with statistical convergence, statistical summability (H, 1) introduced by Móricz (Analysis 24:127-145, 2004) and [H, 1]q-summability. We also give subsequence characterization of statistical summability (H, 1). MSC: 40A0...

متن کامل

New convergence results on the generalized Richardson extrapolation process GREP for logarithmic sequences

approximations A (j) n to A obtained via GREP(1) are defined by the linear systems a(tl) = A (j) n + φ(tl) ∑n−1 i=0 β̄it i l , l = j, j + 1, . . . , j + n, where {tl}l=0 is a decreasing positive sequence with limit zero. The study of GREP(1) for slowly varying functions a(t) was begun in two recent papers by the author. For such a(t) we have φ(t) ∼ αtδ as t → 0+ with δ possibly complex and δ 6= ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1957

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1957-0098927-0